A Polling Model with Reneging at Polling Instants
نویسنده
چکیده
In this paper we consider a single-server, cyclic polling system with switch-over times and Poisson arrivals. The service disciplines that are discussed, are exhaustive and gated service. The novel contribution of the present paper is that we consider the reneging of customers at polling instants. In more detail, whenever the server starts or ends a visit to a queue, some of the customers waiting in each queue leave the system before having received service. The probability that a certain customer leaves the queue, depends on the queue in which the customer is waiting, and on the location of the server. We show that this system can be analysed by introducing customer subtypes, depending on their arrival periods, and keeping track of the moment when they abandon the system. In order to determine waiting time distributions, we regard the system as a polling model with varying arrival rates, and apply a generalised version of the distributional form of Little’s law. The marginal queue length distribution can be found by conditioning on the state of the system (position of the server, and whether it is serving or switching).
منابع مشابه
On a Unifying Theory on Polling Models in Heavy Traffic
For a broad class of polling models the evolution of the system at specific embedded polling instants is known to constitute multitype branching process (MTBP) with immigration. In this paper it is shown that for this class of polling models the vector X that describes the state of the system at these polling instants satisfies the following heavy-traffic behavior, under mild assumptions: (1− ρ...
متن کاملMonotonicity and stability of periodic polling models
This paper deals with the stability of periodic polling models with mixed service policies. The interarrivals to all queues are independent and exponentially distributed and the service and the switch-over times are independent with general distributions. The necessary and suucient condition for the stability of such polling systems is established. The proof is based on the stochastic monotonic...
متن کاملFinite buffer polling models with routing
This paper analyzes a finite buffer polling system with routing. Finite buffers are used to model the limited capacity of the system, and routing is used to represent the need for additional service. The most significant result of the analysis is the derivation of the generating function for queue length when buffer sizes are limited and a representation of the system workload. The queue length...
متن کاملA polling model with an autonomous server
Polling models are used as an analytical performance tool in several application areas. In these models, the focus often is on controlling the operation of the server as to optimize some performance measure. For several applications, controlling the server is not an issue as the server moves independently in the system. We present the analysis for such a polling model with a so-called autonomou...
متن کاملTowards a unifying theory on branching-type polling systems in heavy traffic
For a broad class of polling models the evolution of the system at specific embedded polling instants is known to constitute a multi-type branching process (MTBP) with immigration. In this paper it is shown that for this class of polling models the vector that describes the state of the system at these polling instants, say X = (X1, . . . ,XM), satisfies the following heavy-traffic behavior (un...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Annals OR
دوره 198 شماره
صفحات -
تاریخ انتشار 2012